referential transparency造句
例句与造句
- Some functional programming languages enforce referential transparency for all functions.
- This in turn makes readLine violate referential transparency because it calls doImperativeReadLineSystemCall.
- This property is called " referential transparency ".
- Some programming languages provide means to guarantee referential transparency.
- I agree with Ruud Koot : it should not be merged / redirected to Referential transparency.
- It's difficult to find referential transparency in a sentence. 用referential transparency造句挺难的
- The Scheme dialect of Lisp provides a macro-writing system which provides the referential transparency that eliminates both types of capture problem.
- The importance of referential transparency is that it allows the programmer and the compiler to reason about program behavior as a rewrite system.
- Meanwhile, languages such as Scheme that use hygienic macros prevent accidental capture and ensure referential transparency automatically as part of the macro expansion process.
- As referential transparency requires the same results for any given set of inputs at any point in time, a referentially transparent expression is therefore deterministic.
- Just as Python offers functional-programming constructs but does not attempt to demand referential transparency, it offers an object system but does not demand OOP behavior.
- But this violates referential transparency because calling it multiple times with the same argument will return different results each time as the current position in the file gets moved.
- They can have referential transparency, i . e . the same language expression can result in different values at different times depending on the state of the executing program.
- The primary disadvantage of languages that enforce referential transparency is that they make the expression of operations that naturally fit a sequence-of-steps imperative programming style more awkward and less concise.
- As a computer language, it is notable in combining a declarative ( non-procedural ) structure for referential transparency, array abstraction, and automatic dependency maintenance for efficient sequencing of computation.
- Note that this definition is in terms of values, and is appropriate in functional languages ( it assumes referential transparency ); different trees have no connections, as they are simply lists of values.
更多例句: 下一页